On sojourn times in the finite capacity M/M/1 queue with processor sharing

We consider a processor shared M/M/1 queue that can accommodate at most a finite number K of customers. We give an exact expression for the sojourn time distribution in the finite capacity model, in terms of a Laplace transform. We then give the tail behavior, for the limit K → ∞, by locating the dominant singularity of the Laplace transform. keywords: finite capacity, processor sharing, sojourn time, tail behavior